Implementation of Decisive Plausible Logic (version 1.1)
نویسنده
چکیده
This is a Haskell implementation of Decisive Plausible Logic.1 Decisive Plausible Logic is a new variant of Plausible Logic that handles the looping that complicated previous implementations explicitly, and is defined in terms of a proof function with a three-valued result like the previous implementations, though these essential attributes were not reflected in the formal definition of the logic.
منابع مشابه
Phobos (Version 2): A Query Answering Plausible Logic System
This document is a description of Phobos, a query answering plausible logic system. Phobos is a complete implementation of propositional plausible logic. System components include command-linedriven theorem provers and a web-accessible theorem prover. The system has been implemented in Haskell. This is the short form of this document. The long form includes details about the implementation.
متن کاملA plausible logic which detects loops
Unlike most non-monotonic logics Plausible Logic was designed from the very beginning with computer implementation in mind. But one aspect of implementation was neglected, namely loop detection. When using Plausible Logic choices must be made. Typically all choices are explored and then the best one is chosen. If one choice loops then this needs to be detected so that the other choices can be e...
متن کاملPropositional Plausible Logic: Introduction and Implementation
Plausible Logic allows defeasible deduction with arbitrary propositions, and yet when sufficiently simplified it is very similar to the Defeasible Logics of Billington [7] and Nute [21]. This paper presents Plausible Logic, explains some of the ideas behind the definitions, applies Plausible Logic to an example, and proves a coherence result which indicates that Plausible Logic is well behaved....
متن کاملAn Implementation of Propositional Plausible Logic
We report the first complete implementation of propositional Plausible Logic. Plausible Logic is an extension of Defeasible Logic that overcomes the latter's inability to represent or prove disjunctions. This advantage is significant in dealing with practical applications such as the modeling of regulations. The system has a web interface, which makes it available to researchers and students ev...
متن کاملDIG 2.0 -- Towards a Flexible Interface for Description Logic Reasoners
The DIG Interface provides an implementation-neutral mechanism for accessing Description Logic reasoner functionality. At a high level the interface consists of XML messages sent to the reasoner over HTTP connections, with the reasoner responding as appropriate. Key changes in the current version (DIG 2.0) include support for OWL 1.1 and well-defined mechanisms for extensions to the basic inter...
متن کامل